An Efficient Algorithm for Face Localizatio
نویسندگان
چکیده
and localizing a face in a single image is the most important part of almost all face systems. Face localization aims to determine the image position of a face for verification documents such as passport, driving license, ID cards, etc. In this paper an entropy-based roposed for detecting the high information region of the image which may include eyes, e, etc. The derived regions in this stage of recognition are sent to feature extraction and n phase. The method has been tested on the ORL database. The results show the ss and robustness of the proposed method for face detection and localization in presence dditive Gaussian noise up to 25 dbw. We have achieved localization rate 99.75% for f faces in the ORL data set that we had which means 1 miss over 400 ORL faces. Image processing, Face localization, Recognition, Entropy.
منابع مشابه
Some Conditions for Characterizing Minimum Face in Non-Radial DEA Models with Undesirable Outputs
The problem of utilizing undesirable (bad) outputs in DEA models often need replacing the assumption of free disposability of outputs by weak disposability of outputs. The Kuosmanen technology is the only correct representation of the fully convex technology exhibiting weak disposability of bad and good outputs. Also, there are some specific features of non-radial data envelopment analysis (DEA...
متن کاملA Heuristic Algorithm for Nonlinear Lexicography Goal Programming with an Efficient Initial Solution
In this paper, a heuristic algorithm is proposed in order to solve a nonlinear lexicography goal programming (NLGP) by using an efficient initial point. Some numerical experiments showed that the search quality by the proposed heuristic in a multiple objectives problem depends on the initial point features, so in the proposed approach the initial point is retrieved by Data Envelopment Analysis...
متن کاملAn Efficient Extension of Network Simplex Algorithm
In this paper, an efficient extension of network simplex algorithm is presented. In static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. In this paper, the Static Scheduling problem of Automated Guided Vehicles in container terminal is solved by Network Simplex Algorithm (NSA) and NSA+, which extended the stand...
متن کاملAn Efficient Cluster Head Selection Algorithm for Wireless Sensor Networks Using Fuzzy Inference Systems
An efficient cluster head selection algorithm in wireless sensor networks is proposed in this paper. The implementation of the proposed algorithm can improve energy which allows the structured representation of a network topology. According to the residual energy, number of the neighbors, and the centrality of each node, the algorithm uses Fuzzy Inference Systems to select cluster head. The alg...
متن کاملAn Energy-efficient Mathematical Model for the Resource-constrained Project Scheduling Problem: An Evolutionary Algorithm
In this paper, we propose an energy-efficient mathematical model for the resource-constrained project scheduling problem to optimize makespan and consumption of energy, simultaneously. In the proposed model, resources are speed-scaling machines. The problem is NP-hard in the strong sense. Therefore, a multi-objective fruit fly optimization algorithm (MOFOA) is developed. The MOFOA uses the VIKO...
متن کامل